Browsing by Subject "Upper bounds"
Now showing items 1-8 of 8
-
Article
Bounds on the number of markings consistent with label observations in petri nets
(2009)In this paper, we consider state estimation in discrete-event systems (DESs) modeled by labeled Petri nets and present upper bounds on the number of system states (or markings) that are consistent with an observed sequence ...
-
Conference Object
Distributed spatio-temporal similarity search
(2006)In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to Q, when each of the target trajectories is ...
-
Conference Object
The impact of randomization in smoothing networks
(2008)We revisit smoothing networks[3], which are made up of balancers and wires. Tokens arrive arbitrarily on w input wires and propagate asynchronously through the network
-
Conference Object
Improved performance bounds on max-product algorithms for multiple fault diagnosis in graphs with loops
(2008)In this paper, we analyze the performance of belief propagation max-product algorithms when used to solve the multiple fault diagnosis (MFD) problem. The MFD problem is described by a bipartite diagnosis graph (BDG) which ...
-
Article
Nash equilibria in discrete routing games with convex latency functions
(2008)In a discrete routing game, each of n selfish users employs a mixed strategy to ship her (unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by an arbitrary non-decreasing, non-constant ...
-
Article
Parameter convergence of a new class of adaptive controllers
(1996)A new class of adaptive control schemes for minimum-phase linear time invariant (LTI) systems has recently been developed using nonlinear design techniques which guarantee improved transient performance in addition to ...
-
Conference Object
Probability of error bounds for failure diagnosis and classification in hidden Markov models
(2008)In this paper we consider a formulation of the failure diagnosis problem in stochastic systems as a maximum likelihood classification problem: a diagnoser observes the system under diagnosis online and determines which ...
-
Article
Selfish routing in the presence of network uncertainty
(2009)We study the problem of selfish routing in the presence of incomplete network information. Our model consists of a number of users who wish to route their traffic on a network of m parallel links with the objective of ...